Multiple-Instance Learning: Christoffel Function Approach to Distribution Regression Problem

نویسنده

  • Vladislav Gennadievich Malyshkin
چکیده

A two–step Christoffel function based solution is proposed to distribution regression problem. On the first step, to model distribution of observations inside a bag, build Christoffel function for each bag of observations. Then, on the second step, build outcome variable Christoffel function, but use the bag’s Christoffel function value at given point as the weight for the bag’s outcome. The approach allows the result to be obtained in closed form and then to be evaluated numerically. While most of existing approaches minimize some kind an error between outcome and prediction, the proposed approach is conceptually different, because it uses Christoffel function for knowledge representation, what is conceptually equivalent working with probabilities only. To receive possible outcomes and their probabilities Gauss quadrature for second–step measure can be built, then the nodes give possible outcomes and normalized weights – outcome probabilities. A library providing numerically stable polynomial basis for these calculations is available, what make the proposed approach practical.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple-Instance Learning: Radon-Nikodym Approach to Distribution Regression Problem

For distribution regression problem, where a bag of x–observations is mapped to a single y value, a one–step solution is proposed. The problem of random distribution to random value is transformed to random vector to random value by taking distribution moments of x observations in a bag as random vector. Then Radon–Nikodym or least squares theory can be applied, what give y(x) estimator. The pr...

متن کامل

Different Learning Levels in Multiple-choice and Essay Tests: Immediate and Delayed Retention

    This study investigated the effects of different learning levels, including Remember an Instance (RI), Remember a Generality (RG), and Use a Generality (UG) in multiple-choice and essay tests on immediate and delayed retention. Three-hundred pre-intermediate students participated in the study. Reading passages with multiple-choice and essay questions in different levels of learning were giv...

متن کامل

Fast multiple instance learning via L1, 2 logistic regression

In this paper, we develop an efficient logistic regression model for multiple instance learning that combines L1 andL2 regularisation techniques. AnL1 regularised logistic regression model is first learned to find out the sparse pattern of the features. To train the L1 model efficiently, we employ a convex differentiable approximation of the L1 cost function which can be solved by a quasi Newto...

متن کامل

Salience Assignment for Multiple-Instance Regression

We present a Multiple-Instance Learning (MIL) algorithm for determining the salience of each item in each bag with respect to the bag’s real-valued label. We use an alternating-projections constrained optimization approach to simultaneously learn a regression model and estimate all salience values. We evaluate this algorithm on a significant real-world problem, crop yield modeling, and demonstr...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1511.07085  شماره 

صفحات  -

تاریخ انتشار 2015